Bayesian Optimization for Continuous-time Optimal Control Problem with Unknown Cost Function
نویسندگان
چکیده
منابع مشابه
Bayesian Evolutionary Algorithms for Continuous Function Optimization
Recently many researchers have studied the estimation of distribution algorithms (EDAs) as an optimization method. While most EDAs focus on solving combinatorial optimization problems, only a few algorithms have been proposed for continuous function optimization. In previous work, we developed a Bayesian evolutionary algorithm (BEA) for combinatorial optimization problem using a probabilistic g...
متن کاملMarket Adaptive Control Function Optimization in Continuous Cover Forest Management
Economically optimal management of a continuous cover forest is considered here. Initially, there is a large number of trees of different sizes and the forest may contain several species. We want to optimize the harvest decisions over time, using continuous cover forestry, which is denoted by CCF. We maximize our objective function, the expected present value, with consideration of stochastic p...
متن کاملBayesian Optimization with Unknown Constraints
Recent work on Bayesian optimization has shown its effectiveness in global optimization of difficult black-box objective functions. Many real-world optimization problems of interest also have constraints which are unknown a priori. In this paper, we study Bayesian optimization for constrained problems in the general case that noise may be present in the constraint functions, and the objective a...
متن کاملADAPTIVE FUZZY TRACKING CONTROL FOR A CLASS OF NONLINEAR SYSTEMS WITH UNKNOWN DISTRIBUTED TIME-VARYING DELAYS AND UNKNOWN CONTROL DIRECTIONS
In this paper, an adaptive fuzzy control scheme is proposed for a class of perturbed strict-feedback nonlinear systems with unknown discrete and distributed time-varying delays, and the proposed design method does not require a priori knowledge of the signs of the control gains.Based on the backstepping technique, the adaptive fuzzy controller is constructed. The main contributions of the paper...
متن کامل"Optimal" Hopfield network for combinatorial optimization with linear cost function
An "optimal" Hopfield network is presented for many of combinatorial optimization problems with linear cost function. It is proved that a vertex of the network state hypercube is asymptotically stable if and only if it is an optimal solution to the problem. That is, one can always obtain an optimal solution whenever the network converges to a vertex. In this sense, this network can be called th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 2019
ISSN: 0453-4654,1883-8189
DOI: 10.9746/sicetr.55.100